Schedulability Analysis of Real-time Systems under Dual-priority Scheduling
نویسندگان
چکیده
This paper presents schedulability analysis which has been developed in order to precisely estimate task response times, taking into account kernel execution effects. The analysis takes into consideration specific features of the HARTEX hard real-time kernel, and in particular: asynchronous event-driven operation; integrated scheduling of hard and soft real-time tasks (as well as tasks and resources) and advanced task management, whereby kernel operations are executed in constant time, independent of the number of tasks involved. The developed test has been incorporated into a system specification and analysis tool supporting HARTEX-based real-time applications.
منابع مشابه
Demand-based schedulability analysis for real-time multi-core scheduling
In real-time systems, schedulability analysis has been widely studied to provide offline guarantees on temporal correctness, producing many analysis methods. The demand-based schedulability analysis method has a great potential for high schedulability performance and broad applicability. However, such a potential is not yet fully realized for real-time multi-core scheduling mainly due to (i) th...
متن کاملSuspension-Aware Schedulability Analysis for Multiprocessor Embedded Systems
In many embedded systems, tasks may experience suspension delays. The problem of analyzing task systems with such suspensions on multiprocessors has been relatively unexplored. The commonly used suspension-oblivious approach of treating all suspensions as computation can be quite pessimistic. As an alternative, this paper presents the first suspension-aware multiprocessor schedulability analysi...
متن کاملOn Fixed Priority Preemptive Scheduling for Imprecise Computation
We present new results in fixed priority scheduling for imprecise computation in real-time systems. Imprecise computation has not been popularized enough for reasons which are rooted from the task model, scheduling methods (EDF-based) and general system support. Audsley et al. have devised schedulability tests for guaranteeing mandatory computation while incorporating unbounded optional compone...
متن کاملA faster exact schedulability analysis for fixed-priority scheduling
Real-time scheduling for task sets has been studied, and the corresponding schedulability analysis has been developed. Due to the considerable overheads required to precisely analyze the schedulability of a task set (referred to as exact schedulability analysis), the trade-off between precision and efficiency is widely studied. Many efficient but imprecise (i.e., sufficient but not necessary) a...
متن کاملMultiprocessor Schedulability Analysis for Self - Suspending Task Systems ∗
In many real-time systems, tasks may experience suspension delays. The problem of analyzing task systems with such suspensions on multiprocessors has been relatively unexplored and is thought to be difficult (as it is on uniprocessors). In this paper, hard/soft multiprocessor schedulability tests for arbitrary-deadline sporadic self-suspending task systems are presented for both global EDF and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002